Although the click farming on e-commerce platform improves the store profits to some extent, but it raises the promotion cost of e-commerce platform, which leads to a serious problem of reputation security, and on the other hand, it misleads consumers with property loss. To solve these problems, an intelligent method named SVM-NB was proposed for detecting the click farming on e-commerce platform for users, and a method of constructing characteristics of click farming was also put forward. Firstly, the relevant data of commodity were collected to create an eigenvalue database. Then a classifier was established based on Support Vector Machine (SVM) algorithm with supervised learning, so as to judge the result of click farming. Finally, the click farming probability of goods was calculated by using Naive Bayes (NB), which can provides users with a reference for their shopping. The reasonality and accuracy of the proposed SVM-NB method was validated by K-fold cross validation algorithm, and the accuracy reached 95.0536%.

Since most malwares are designed using decentralized architecture to resist detection and countering, in order to fast and accurately detect Peer-to-Peer (P2P) bots at the stealthy stage and minimize their destructiveness, a real-time detection system for stealthy P2P bots based on statistical features was proposed. Firstly, all the P2P hosts inside a monitored network were detected using means of machine learning algorithm based on three P2P statistical features. Secondly, P2P bots were discriminated based on two P2P bots statistical features. The experimental results show that the proposed system is able to detect stealthy P2P bots with an accuracy of 99.7% and a false alarm rate below 0.3% within 5 minutes. Compared to the existing detection methods, this system requires less statistical characteristics and smaller time window, and has the ability of real-time detection.

The thorough research on ant colony algorithm points out that the ant colony algorithm has superiority in solving large nonlinear optimization problem. Through careful analysis of the deficiencies that genetic algorithm and particle swarm algorithm solve the problem of vehicle dispatching system, based on the advantage of ant colony algorithm and the own characteristics of vehicle dispatching system, the basic ant colony algorithm was improved in the paper, and the algorithm framework was created. Based on the linear programming theory, the article established mathematical model and operation objectives and constraints for vehicle dispatching system, and got the optimal solution of vehicle dispatching system problem with the improved ant colony algorithm. According to the optimal solution and the dispatching criterion real-time scheduling was achieved. The article used Java language to write a simulation program for comparing the improved particle swarm optimization algorithm and ant colony algorithm. Through the comparison, it is found a result that the improved ant colony algorithm is correct and effective to solve the vehicle dispatching optimization problem.

The existing Web services discovery method has limitations in time cost and accuracy because it does not make full use of the user context. Firstly, the clustering of similar user context was implemented to greatly reduce retrieval range of Web services. Secondly, based on this, making use of the current users' preference information and the history users' QoS-aware data, a method of Web services discovery based on history users' QoS-awareness was proposed. Finally, the comparison to other Web services methods indicates that this method is better than several other methods both in time cost and accuracy of Web services discovery.

In order to improve spectrum usage in Cognitive Radio System (CRS), and reduce channel switching frequency, a new prediction mechanism was designed, which was used chaotic neural network to analyze and predict the last time of channel status. Simulation results show that the prediction accuracy can reach 90%, thus the effectivess of this new prediction mechanism was proved.

In order to discover the special behaviors of Sub Complex System (SCS) under intervention, the authors proposed the concept of contrast inequality, proposed and implemented the algorithm for mining the segmentwise intervention; by imposing perturbance intervention on SCS, the authors proposed and implemented the causality discovery algorithm. The experiments on the real data show that segmentwise intervention algorithm discovers new intervention rules, and the causality discovery algorithm discovers the causality relations in the air pollution data set, and both are difficultly discovered by traditional methods.